Generalized Huffman coding for binary trees with choosable edge lengths
نویسندگان
چکیده
منابع مشابه
Generalized Huffman Coding for Binary Trees with Choosable Edge Lengths
In this paper we study binary trees with choosable edge lengths, in particular rooted binary trees with the property that the two edges leading from every non-leaf to its two children are assigned integral lengths l1 and l2 with l1 + l2 = k for a constant k ∈ N. The depth of a leaf is the total length of the edges of the unique root-leaf-path. We present a generalization of the Huffman Coding t...
متن کاملMinimal Spanning Trees for Graphs with Random Edge Lengths
The theory of the minimal spanning tree (MST) of a connected graph whose edges are assigned lengths according to independent identically distributed random variables is developed from two directions. First, it is shown how the Tutte polynomial for a connected graph can be used to provide an exact formula for the length of the minimal spanning tree under the model of uniformly distributed edge l...
متن کاملConsistent Markov branching trees with discrete edge lengths∗
We study consistent collections of random fragmentation trees with random integervalued edge lengths. We prove several equivalent necessary and sufficient conditions under which Geometrically distributed edge lengths can be consistently assigned to a Markov branching tree. Among these conditions is a characterization by a unique probability measure, which plays a role similar to the dislocation...
متن کاملA family of random trees with random edge lengths
We introduce a family of probability distributions on the space of trees with I labeled vertices and possibly extra unlabeled vertices of degree 3, whose edges have positive real lengths. Formulas for distributions of quantities such as degree sequence, shape, and total length are derived. An interpretation is given in terms of sampling from the inhomogeneous continuum random tree of Aldous and...
متن کاملEdge separators for quasi-binary trees
One wishes to remove k − 1 edges of a vertex-weighted tree T such that the weights of the k induced connected components are approximately the same. How well can one do it ? In this paper, we investigate such k-separator for quasi-binary trees. We show that, under certain conditions on the total weight of the tree, a particular k-separator can be constructed such that the smallest (respectively...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2015
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.11.013